منابع مشابه
Design an Efficient Community-based Message Forwarding Method in Mobile Social Networks
Mobile social networks (MSNs) are a special type of Delay tolerant networks (DTNs) in which mobile devices communicate opportunistically to each other. One of the most challenging issues in Mobile Social Networks (MSNs) is to design an efficient message forwarding scheme that has a high performance in terms of delivery ratio, latency and communication cost. There are two different approaches fo...
متن کاملSnap-Stabilizing Linear Message Forwarding
In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being independent of any global parameter, that is 4 buffers per link. The protocol works on a linear chain of nodes, that is possibly an overlay on a largescale and dynamic system, e.g., Peer-to-Peer systems, Grids. . . Provided that the topology remains a linear chain and th...
متن کاملEarly Detection of Message Forwarding Faults
In most communication networks, pairs of processors communicate by sending messages over a path connecting them. We present communication e cient protocols that quickly detect and locate any failure along the path. Whenever there is excessive delay in forwarding messages along the path, the protocols detect a failure (even when the delay is caused by maliciously-programmed processors). The prot...
متن کاملSelective Message Forwarding in Delay Tolerant Networks
It is challenging to deliver messages in a network where no instant end-to-end path exists, so called Delay-Tolerant Network (DTN). Node encounters are used for message forwarding. In this paper, we propose a DTN routing protocol SMART. SMART utilizes the travel companions of the destinations (i.e. nodes that frequently meet the destination) to increase the delivery opportunities while limiting...
متن کاملAn Eecient Multipath Forwarding Method
| We motivate and formally deene dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suux matched, forwarding can be eeciently implemented with (1) a per packet overhead of a small, xed-length path identiier, and (2) router space overhead linear in K, the number of alternate paths between a sour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2015
ISSN: 1556-5068
DOI: 10.2139/ssrn.3026936